Wardrop Equilibria
نویسندگان
چکیده
A common behavioral assumption in the study of transportation and telecommunication networks is that travelers or packets, respectively, choose routes that they perceive as being the shortest under the prevailing traffic conditions [1]. The situation resulting from these individual decisions is one in which drivers cannot reduce their journey times by unilaterally choosing another route, which prompted Knight [2] to call the resulting traffic pattern an equilibrium. Nowadays, it is indeed known as the Wardrop (or user) equilibrium [3], and it is effectively thought of as a steady state evolving after a transient phase in which travelers successively adjust their route choices until a situation with stable route travel costs and route flows has been reached [4]. In a seminal contribution, Wardrop [5, p. 345] stated two principles that formalize this notion of equilibrium and the alternative postulate of the minimization of the total travel costs. His first principle reads:
منابع مشابه
Cooperative dynamics and Wardrop equilibria
A simple dynamics capturing user behavior in a network is shown to lead to equilibria that can be viewed as approximate, generalized Wardrop equilibria.
متن کاملDynamic Cesaro-Wardrop equilibration in networks
We analyze a routing scheme for a broad class of networks which converges (in the Cesaro sense) with probability one to the set of approximate Cesaro–Wardrop equilibria, an extension of the notion of a Wardrop equilibrium. The network model allows for wireline networks where delays are caused by flows on links, as well as wireless networks, a primary motivation for us, where delays are caused b...
متن کاملDistributed Learning of Wardrop Equilibria
We consider the problem of learning equilibria in a well known game theoretic traffic model due to Wardrop. We consider a distributed learning algorithm that we prove to converge to equilibria. The proof of convergence is based on a differential equation governing the global macroscopic evolution of the system, inferred from the local microscopic evolutions of agents. We prove that the differen...
متن کاملFrom discrete to continuous Wardrop equilibria
The notion of Wardrop equilibrium in congested networks has been very popular in congested traffic modelling since its introduction in the early 50’s, it is also well-known that Wardrop equilibria may be obtained by some convex minimization problem. In this paper, in the framework of Γ-convergence theory, we analyze what happens when a cartesian network becomes very dense. The continuous model ...
متن کاملWardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic
We look at the scenario of having to route a continuous rate of traffic from a source node to a sink node in a network, where the objective is to maximize throughput. This is of interest, e.g., for providers of streaming content in communication networks. The overall path latency, which was relevant in other non-cooperative network routing games such as the classic Wardrop model, is of lesser c...
متن کاملNash and Wardrop equilibria in aggregative games with coupling constraints
We consider the framework of aggregative games, in which the cost function of each agent depends on his own strategy and on the average population strategy. As first contribution, we investigate the relations between the concepts of Nash and Wardrop equilibrium. By exploiting a characterization of the two equilibria as solutions of variational inequalities, we bound their distance with a decrea...
متن کامل